Going Native: Faster Architectural Simulation Fast-Forwarding
نویسندگان
چکیده
As system complexity grows, cycle-accurate simulation experiments become inordinately time consuming. Most approaches to accelerating architectural simulation model only portions of an application in detail. Detailed simulation begins with architectural state from earlier portions of the execution. Constructing this requires fast-forwarding: modeling effects of earlier instructions without modeling full architectural details. Fast-forwarding usually employs functional simulation within the cycle-accurate model. We present a rapid fast-forwarding technique, NativeFF, that leverages native execution and Application-Level Checkpointing. We demonstrate its viability by moving checkpointed state for a range of applications between native execution on an Alpha 21264 system and simulated execution in SimpleScalar Version 4.0. Our approach is orthogonal to—and combines well with—other approaches for reducing design space explorations, including SimPoint, SMARTS, reduced input sets, and Plackett-Burman or other statistical evaluations to reduce the experiment space required to generate sufficiently reliable results. Our experiments demonstrate that NativeFF reduces experiment time dramatically with minimal application perturbation.
منابع مشابه
Unified Modeling Abstraction for Fast Simulation and Emulation
With the increasing design size of SoC’s and chip multiprocessors, simulation models are not sufficiently fast to accommodate performance evaluation with realistic benchmarks. Emulating the performance models in programmable hardware (FPGA) is an attractive solution for speeding up performance analysis [1], [2], [9], [10], [11]. This poses the following requirements on the design of the perform...
متن کاملInput Fast-Forwarding for Better Deep Learning
This paper introduces a new architectural framework, known as input fast-forwarding, that can enhance the performance of deep networks. The main idea is to incorporate a parallel path that sends representations of input values forward to deeper network layers. This scheme is substantially different from “deep supervision,” in which the loss layer is re-introduced to earlier layers. The parallel...
متن کاملIP Lookup using Two-level Indexing and B-Trees
Networks are expanding very fast and the number of clients is increasing dramatically, this causes the router forwarding table to become very large and present more demand on faster router operations. In this paper, we address the problem of packet forwarding in the routers aiming to increase the speed of address lookup and minimize the memory required for storing the forwarding table. We propo...
متن کاملFast Update of Forwarding Tables in Internet Router Using AS Numbers
The updates of router forwarding tables can be made faster using the Autonomous System number corresponding to a prefix as an intermediate number between the prefix and the next-hop address. At the cost of fast update, one table lookup introduces small additional delay, which can be eliminated by pipelining. This scheme is applicable to several routing table lookup algorithms for fast update.
متن کاملMeasuring the Evolution of Automotive Software Models and Meta-Models to Support Faster Adoption of New Architectural Features
Background: The ever-increasing amount of software in cars today combined with high market competition demands fast adoption of new software solutions in car development projects. One challenge in enabling such a fast adoption is to develop the architecture and models of the automotive software systems in a structured and controlled way. Objective: The main objective of this thesis was to enabl...
متن کامل